Online Scheduling Intervals and t-Intervals
نویسندگان
چکیده
A t-interval is a union of at most t half-open intervals on the real line. The special case where t = 1 is an interval. Often, the requests for contiguous allocation of a linear resource can be modeled by a sequence of t-intervals. We consider the problems of online scheduling intervals and t-intervals, which show up in Video-on-Demand services, high speed networks and molecular biology, among others. We derive lower bounds and (almost) matching upper bounds on the competitive ratios of randomized algorithms for scheduling intervals, 2-intervals and t-intervals, for any t > 2. While offline t-interval scheduling has been studied before, the online version is considered here for the first time.
منابع مشابه
Online t-Interval Scheduling
This paper deals with non-preemptive online t-interval scheduling. A tinterval is a union of t half-open intervals (segments). In online scheduling the t-intervals are presented incrementally and each presented interval must be accepted or lost forever. A presented t-interval which overlaps a previously accepted t-interval cannot be accepted. The decision of whether or not to accept an interval...
متن کاملProposing an approach to calculate headway intervals to improve bus fleet scheduling using a data mining algorithm
The growth of AVL (Automatic Vehicle Location) systems leads to huge amount of data about different parts of bus fleet (buses, stations, passenger, etc.) which is very useful to improve bus fleet efficiency. In addition, by processing fleet and passengers’ historical data it is possible to detect passenger’s behavioral patterns in different parts of the day and to use it in order to improve fle...
متن کاملPower-aware Online Dynamic Scheduling for Multiple Feasible Intervals
Multiple Feasible Intervals (MFI) is a task model which has more than one interval for each task instance to run. In our previous work, different scheduling algorithms are proposed for both static MFI dynamic MFI during run-time. Real-life situations demand dynamic MFI, but calculating an MFI schedule is a NP-Hard problem and efficiency of algorithm itself is one of the main concerns. In this p...
متن کاملReliability-based maintenance scheduling of powered supports in Tabas mechanized coal mine
Utilizing the gathered failure data and failure interval data from Tabas coal mine in two years, this paper discusses the reliability of powered supports. The data sets were investigated using statistical procedures and in two levels: the existence of trend and serial correlation. The results show that the powered supports follow the Gamma reliability function. The reliability of the machine de...
متن کاملFair Scheduling of Real-Time Tasks on Multiprocessors
There has been much recent interest in fair scheduling algorithms for real-time multiprocessor systems. The roots of much of the research on this topic can be traced back to the seminal work of Baruah et al. on Proportionate fairness (Pfairness) [6]. This work proved that the problem of optimally scheduling periodic tasks1 on multiprocessors could be solved on-line in polynomial time by using P...
متن کامل